A SA-VNS approach for the High School Timetabling Problem
نویسندگان
چکیده
منابع مشابه
A SA-VNS approach for the High School Timetabling Problem
The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simula...
متن کاملA SA-ILS approach for the High School Timetabling Problem
This work presents a heuristic approach proposed by one of the finalists of the Third International Timetabling Competition (ITC2011). The KHE school timetabling engine is used to generate an initial solution and then Simulated Annealing (SA) and Iterated Local Search (ILS) perform local search around this solution.
متن کاملSAT-Based Approaches for the General High School Timetabling Problem
High School Timetabling (HSTT) is a well known and widespread problem. The problem consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. lectures) with respect to various constraints. Unfortunately, HSTT is hard to solve and just finding a feasible solution for simple variants of HSTT have been proven to be NP-complete. In this work, we consider the general HSTT pro...
متن کاملInteger programming for the generalized high school timetabling problem
Recently the XHSTT format for (High) School Timetabling was introduced, which provides a uniform way of modeling problem instances and corresponding solutions. The format supports a big variety of constraints, and currently 38 real-life instances from 11 di erent countries are available. Thereby the XHSTT format serves as a common ground for researchers within this area. This paper describes th...
متن کاملAn Evolutionary Approach to the School Timetabling Problem
We present a general heuristic technique that solves a timetabling problem, such as school timetabling. It is based on a Hopfield-type neural network, whose complexity was significantly reduced by incorporating a genetic algorithm into a very first stage of the timetabling process. The goal of the GA was to initialize the network so that the number of neurons and their connections decreased, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2012
ISSN: 1571-0653
DOI: 10.1016/j.endm.2012.10.023